polynomial time meaning in Chinese
多项式时间
Examples
- A polynomial time algorithm in positive define geometric programming with constraints
约束正定式几何规划的一种多项式时间算法 - Because it can " t finish in polynomial time , the scheduling problem is known to be np - hard
由于该问题不能在多项式时间内求得最优解，因而被公认为一个np完全问题。 - The complexity of kf - diff is o ( nlogn ) , while n is the number of the nodes in the tree , vs . polynomial time for previous algorithms
在算法复杂度上从先前的多项式时间提高到o ( nlogn ) ，其中n为文档结点数。 - Radio communications systems , department of signals , sensors and systems , royal institute of technology , 10044 stockholm , sweden , october 2002 . 10 hajck b , wieselthier j . link scheduling in polynomial time
绝大部分方法在网络中有20 30个结点， 100 200条链路时就需要花几天甚至更多的时间来寻找最优调度。